- parallel algorithm folding method
- 并行算法折叠方法
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
parallel algorithm folding method
Look at other dictionaries:
Parallel computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Molecular dynamics — (MD) is a computer simulation of physical movements of atoms and molecules. The atoms and molecules are allowed to interact for a period of time, giving a view of the motion of the atoms. In the most common version, the trajectories of molecules… … Wikipedia
Protein domain — Pyruvate kinase, a protein from three domains (PDB 1pkn) A protein domain is a part of protein sequence and structure that can evolve, function, and exist independently of the rest of the protein chain. Each domain forms a compact three… … Wikipedia
List of distributed computing projects — A list of distributed computing projects. Berkeley Open Infrastructure for Network Computing (BOINC) The Berkeley Open Infrastructure for Network Computing (BOINC) platform is currently the most popular volunteer based distributed computing… … Wikipedia
Narendra Karmarkar — Narendra K. Karmarkar (born 1957) is an Indian mathematician, renowned for developing Karmarkar s algorithm. He is listed as an ISI highly cited researcher.[1] Contents 1 Biography 2 Work 2.1 Karmark … Wikipedia
Structural alignment — is a form of sequence alignment based on comparison of shape. These alignments attempt to establish equivalences between two or more polymer structures based on their shape and three dimensional conformation. This process is usually applied to… … Wikipedia
computer — computerlike, adj. /keuhm pyooh teuhr/, n. 1. Also called processor. an electronic device designed to accept data, perform prescribed mathematical and logical operations at high speed, and display the results of these operations. Cf. analog… … Universalium
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Connected Mathematics — is a comprehensive, problem centered curriculum designed for all students in grades 6 8 based on the NCTM standards. The curriculum was developed by the Connected Mathematics Project (CMP) at Michigan State University and funded by the National… … Wikipedia
